Designing PTASs for MIN-SUM scheduling problems
نویسندگان
چکیده
منابع مشابه
Scheduling–lps Bear Probabilities Randomized Approximations for Min–sum Criteria Scheduling–lps Bear Probabilities Randomized Approximations for Min–sum Criteria
In this paper, we provide a new class of randomized approximation algorithms for scheduling problems by directly interpreting solutions to so-called time-indexed LPs as probabilities. The most general model we consider is scheduling unrelated parallel machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. The crucial idea for these multi...
متن کاملMin-Sum Scheduling Under Precedence Constraints
In many scheduling situations, it is important to consider non-linear functions of job completions times in the objective. This was already recognized by Smith (1956). Recently, the theory community has begun a thorough study of the resulting problems, mostly on single-machine instances for which all permutations of jobs are feasible. However, a typical feature of many scheduling problems is th...
متن کاملA Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
We consider the following single-machine scheduling problem, which is often denoted 1|| ∑ fj: we are given n jobs to be scheduled on a single machine, where each job j has an integral processing time pj, and there is a nondecreasing, nonnegative cost function fj(Cj) that specifies the cost of finishing j at time Cj ; the objective is to minimize ∑n j=1 fj(Cj). Bansal & Pruhs recently gave the f...
متن کاملDual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
Linear programming (LP)-based relaxations have proven to be useful in enumerative solution procedures for N P-hard min-sum scheduling problems. We take a dual viewpoint of the time-indexed integer linear programming (ILP) formulation for these problems. Previously proposed Lagrangian relaxation methods and a time decomposition method are interpreted and synthesized under this view. Our new resu...
متن کاملScheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
In this paper, we provide a new class of randomized approximation algorithms for scheduling problems by directly interpreting solutions to so-called time-indexed LPs as probabilities. The most general model we consider is scheduling unrelated parallel machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. The crucial idea for these multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.05.014